Computational Indistinguishability: A Sample Hierarchy

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Indistinguishability: A Sample Hierarchy

We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given k0 < k samples. It is well known that in any such pair of ensembles it cannot be that both are efficiently computable (and that such phenomena cannot exist for nonuniform classes of distinguishers, say, polynomial-size c...

متن کامل

A Note on Computational Indistinguishability

-We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of efficiently constructible distributions which are computationally indistinguish­ able but statisticaUy very different.

متن کامل

Termination-Insensitive Computational Indistinguishability

We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic-indistinguishability). Tic-indistinguishability models indistinguishability with respect to distinguishers that cannot distinguish between termination and non-termination. We sketch how the new notion allows to get computational soundness results of symbolic models for ...

متن کامل

Towards a Coinductive Characterization of Computational Indistinguishability

Computational indistinguishability (CI in the following) is one of the most central concepts in modern cryptography, and many other definitions (e.g. pseudorandomness, security of cryptographic schemes) can be formulated in terms of CI. We present the results of a study directed towards giving a direct and precise characterization of computational indistinguishability in an higher-order functio...

متن کامل

A NOTE ON COMPUTATIONAL INDISTINGUISHABILITY 1 Oded

| We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of eeciently constructible distributions which are computationally indistinguishable but statistically very diierent.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1999

ISSN: 0022-0000

DOI: 10.1006/jcss.1999.1652